Object-Oriented Constraint Satisfaction
نویسندگان
چکیده
Constraint satisfaction problems are limited in that their domain values are treated as atomic entities, causing specifications for infinite CSPs to be solver-dependent. ObjectOriented Constraint Satisfaction Problems (OOCSPs) synthesize the object-oriented paradigm with declarative constraints to provide a rich language for describing infinite domains, independent of the solver. This paper introduces the concept of an OOCSP, describes algorithms for solving certain classes of OOCSPs, and gives an undecidability result that shows not all OOCSPs can be solved.
منابع مشابه
Object-Oriented Constraint Satisfaction
Constraint satisfaction problems are limited in that their domain values are treated as atomic entities. Object-Oriented Constraint Satisfaction Problems (OOCSPs) synthesize the object-oriented paradigm with declarative constraints to provide a rich language for describing domains. This paper introduces the concept of an OOCSP, describes algorithms for solving certain classes of OOCSPs, and giv...
متن کاملYet another object-oriented constraint resolution system: an open architecture approach
In this paper we present YAFCRS, a new object-oriented constraint system which ensures backtracking-based global resolution. First, based on objects, we define a modular representation of constraint satisfaction problems and provide a general algorithmic framework to resolve them. Then, by the definition of compound constraint classes, we allow to state compound constraints on any objects. In o...
متن کاملConstraint-Based Modeling of InterOperability Problems Using an Object-Oriented Approach
ADIOP is an application for Automated Diagnosis of InterOperability Problems. Interoperability testing involves checking the degree of compatibility between two networking devices that implement the same protocol. In ADIOP, each interoperability test case is first modeled as a Constraint Satisfaction Problem. Object-Oriented Programming is used to implement ADIOP. In this paper, we present the ...
متن کاملReifying Constraint Satisfaction in Smalltalk
We discuss the problem of the representation of constraints in an object-oriented programming language. We focus on a particular topic constraint satisfaction for finite domains and propose a class library that integrates constraints within an object-oriented language. The library is based on the systematic reification of variables, constraints, problems and algorithms. The library is implement...
متن کاملGenerator and Search Objects in Java
Generator classes are defined in the object oriented programming language Java by using continuation-style programming. Generator objects are used to write Prolog-like programs in Java to solve combinatorial constraint satisfaction problems. A collection of generators oriented to world wide web applications is demonstrated on searches for HTML pages.
متن کامل